@article{incGM,
  title={Incremental frequent subgraph mining on large evolving graphs},
  author={Abdelhamid, Ehab and Canim, Mustafa and Sadoghi, Mohammad and Bhattacharjee, Bishwaranjan and Chang, Yuan-Chi and Kalnis, Panos},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  volume={29},
  number={12},
  pages={2710--2723},
  year={2017},
  publisher={IEEE}
}
@article{grami,
  title={Grami: Frequent subgraph and pattern mining in a single large graph},
  author={Elseidy, Mohammed and Abdelhamid, Ehab and Skiadopoulos, Spiros and Kalnis, Panos},
  journal={Proceedings of the VLDB Endowment},
  volume={7},
  number={7},
  pages={517--528},
  year={2014},
  publisher={VLDB Endowment}
}
@inproceedings{mni,
  title={What is frequent in a single graph?},
  author={Bringmann, Bj{\"o}rn and Nijssen, Siegfried},
  booktitle={Pacific-Asia Conference on Knowledge Discovery and Data Mining},
  pages={858--863},
  year={2008},
  organization={Springer}
}
@inproceedings{VF2,
  title={An improved algorithm for matching large graphs},
  author={Cordella, Luigi Pietro and Foggia, Pasquale and Sansone, Carlo and Vento, Mario},
  booktitle={3rd IAPR-TC15 workshop on graph-based representations in pattern recognition},
  pages={149--159},
  year={2001}
}
